Cache and carry

Approximate Ripple Carry and Carry Lookahead Adders - A Comparative Analysis

Approximate ripple carry adders (RCAs) and carry lookahead adders (CLAs) are presented which are compared with accurate RCAs and CLAs for performing a 32-bit addition. The accurate and approximate RCAs and CLAs are implemented using a 32/28nm CMOS process. Approximations ranging from 4to 20-bits are considered for the less significant adder bit positions. The simulation results show that approx...

A Power Aware Cache and Register File Design Space Exploration

Variable delay ripple carry adder with carry chain interrupt detection

Various implementations are known for the efficient implementation of adders. As opposed to traditional optimization techniques a statistical approach using early termination detection is used in this article to obtain efficient implementations for large operands. The completion detection logic is described and the efficiency of the approach is shown and analyzed analytically and through comput...

Cache-Aware and Cache-Oblivious Adaptive Sorting

Two new adaptive sorting algorithms are introduced which perform an optimal number of comparisons with respect to the number of inversions in the input. The first algorithm is based on a new linear time reduction to (non-adaptive) sorting. The second algorithm is based on a new division protocol for the GenericSort algorithm by Estivill-Castro and Wood. From both algorithms we derive I/O-optima...

Cache-aware and Cache-oblivious Algorithms

---------------------------------------------------------------------------------------------iii Table of